منابع مشابه
Some properties of b-weakly compact operators on Banach lattices
In this paper we give some necessary and sufficient conditions for which each Banach lattice is space and we study some properties of b-weakly compact operators from a Banach lattice into a Banach space . We show that every weakly compact operator from a Banach lattice into a Banach space is b-weakly compact and give a counterexample which shows that the inverse is not true but we prove ...
متن کاملOrder Almost Dunford-Pettis Operators on Banach Lattices
By introducing the concepts of order almost Dunford-Pettis and almost weakly limited operators in Banach lattices, we give some properties of them related to some well known classes of operators, such as, order weakly compact, order Dunford-Pettis, weak and almost Dunford- Pettis and weakly limited operators. Then, we characterize Banach lat- tices E and F on which each operator from E into F t...
متن کاملOn finite elements in vector lattices and Banach lattices
In Archimedean vector lattices we show that each element of the band generated by a finite element is also finite. In vector lattices with the (PPP) and in Banach lattices we obtain some characterizations of finite elements by using the generalized order units for principal bands. In the case of Banach lattices with order continuous norm the ideal of all finite elements coincides with the linea...
متن کاملOn Nonatomic Banach Lattices and Hardy Spaces
We are interested in the question when a Banach space X with an unconditional basis is isomorphic (as a Banach space) to an order-continuous nonatomic Banach lattice. We show that this is the case if and only if X is isomorphic as a Banach space with X(i2). This and results of Bourgain are used to show that spaces HI (Tn) are not isomorphic to nonatomic Banach lattices. We also show that tent s...
متن کاملAggregating Algorithm competing with Banach lattices
The paper deals with on-line regression settings with signals belonging to a Banach lattice. Our algorithms work in a semi-online setting where all the inputs are known in advance and outcomes are unknown and given step by step. We apply the Aggregating Algorithm to construct a prediction method whose cumulative loss over all the input vectors is comparable with the cumulative loss of any linea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-06-08536-4